Modeling a Cache Coherence Protocol with the Guarded Action Language
نویسندگان
چکیده
We present a formal model built for verification of the hardware Tera-Scale ARchitecture (TSAR), focusing on its Distributed Hybrid Cache Coherence Protocol (DHCCP). This protocol is by nature asynchronous, concurrent and distributed, which makes classical validation of the design (e.g. through testing) difficult. We therefore applied formal methods to prove essential properties of the protocol, such as absence of deadlocks, eventual consensus, and fairness.
منابع مشابه
Experience with Predicate Abstraction
This reports some experiences with a recently-implemented prototype system for veriication using predicate abstraction, based on the method of Graf and Sa di 9]. Systems are described using a language of iterated guarded commands, called Mur ?? (since it is a simpliied version of our Mur protocol description language). The system makes use of two libraries: SVC 1] (an eecient decision procedure...
متن کاملVeriication of the Futurebus+ Cache Coherence Protocol
We used a hardware description language to construct a formal model of the cache coherence protocol described in the draft IEEE Futurebus+ standard. By applying temporal logic model checking techniques, we found several errors in the standard. The result of our project is a concise, comprehensible and unambiguous model of the protocol that should be useful both to the Futurebus+ Working Group m...
متن کاملIntegrating Formal Verification with Mur ? of Distributed Cache Coherence Protocols in FAME Multiprocessor System Design
Flexible Architecture for Multiple Environments (FAME) is Bull architecture for large symmetrical multiprocessors based on Intel’s Itanium® 2 family, which is used in Bull NovaScale® servers series. A key point in the development of this distributed shared memory architecture is the definition of its cache coherence protocol. This paper reports experiences and results of integrating formal veri...
متن کاملModeling Cache Coherence Protocol - A Case Study with FLASH
This paper is devoted to the speciication of the Stanford FLASH cache coherence protocol within the ASM formalism. Correctness proofs related to data consistency are presented. Corner cases that leads to unlikely situations are exhibited.
متن کاملExact and Efficient Verification of Parameterized Cache Coherence Protocols
We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. For reasoning about general snoopy cache protocols, we introduce the guarded broadcast protocols model and show how an abstract history graph construction can be used to reason about safety properties for this framework. Althoug...
متن کامل